Polychromatic Hamilton cycles

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polychromatic Hamilton cycles

The edges of the complete graph Kn are coloured so that no colour appears no more than k times, k = [n/Alnn], for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic. 'Supported by NSF grant CCR-89000112

متن کامل

Packing Hamilton Cycles Online

It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge disjoint Hamilton cycles, [4], [13], [9]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ≥ 2, if random edges of Kn are presented one by one then w.h.p. it is possible to color the edges online with σ color...

متن کامل

Edge Disjoint Hamilton Cycles

In the late 70s, it was shown by Komlós and Szemerédi ([7]) that for p = lnn+ln lnn+c n , the limit probability for G(n, p) to contain a Hamilton cycle equals the limit probability for G(n, p) to have minimum degree at least 2. A few years later, Ajtai, Komlós and Szemerédi ([1]) have shown a hitting time version of this in the G(n,m) model. Say a graph G has property H if it contains bδ(G)/2c ...

متن کامل

Multicoloured Hamilton Cycles

Mi hael Albert, Alan Frieze and Bru e Reed Department of Mathemati s, Carnegie-Mellon University, Pittsburgh, U.S.A.y Submitted: April 25th,1995 A epted May 9th, 1995 Abstra t The edges of the omplete graph Kn are oloured so that no olour appears more than d ne times, where < 1=32 is a onstant. We show that if n is suÆ iently large then there is a Hamiltonian y le in whi h ea h edge is a di ere...

متن کامل

Hamilton cycles in prisms

The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of having a hamiltonian prism. c © ???...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1993

ISSN: 0012-365X

DOI: 10.1016/0012-365x(93)90054-w